A Symmetric Rank - Revealing Toeplitz Matrix
نویسندگان
چکیده
In signal and image processing, regularization often requires a rank-revealing decomposition of a symmetric Toeplitz matrix with a small rank deeciency. In this paper, we present an eecient factorization method that exploits symmetry as well as the rank and Toeplitz properties of the given matrix.
منابع مشابه
On the Fast Reduction of Symmetric Rationally Generated Toeplitz Matrices to Tridiagonal Form
In this paper two fast algorithms that use orthogonal similarity transformations to convert a symmetric rationally generated Toeplitz matrix to tridiagonal form are developed, as a means of finding the eigenvalues of the matrix efficiently. The reduction algorithms achieve cost efficiency by exploiting the rank structure of the input Toeplitz matrix. The proposed algorithms differ in the choice...
متن کاملFast Structured Matrix Computations: Tensor Rank and Cohn-Umans Method
We discuss a generalization of the Cohn–Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn–Umans method may be used for bilinear operations other than matrix multiplication, with algebras other than group algebras, and we relate it to Strassen’s tensor rank ...
متن کاملNORTH- HOLLAND High Performance Algorithms for Toeplitz and Block Toeplitz Matrices
In this paper, we present several high performance variants of the classical Schur algorithm to factor various Toeplitz matrices. For positive definite block Toeplitz matrices, we show how hyperbolic Householder transformations may be blocked to yield a block Schur algorithm. This algorithm uses BLAS3 primitives and makes efficient use of a memory hierarchy. We present three algorithms for inde...
متن کاملAccurate Symmetric Rank Revealing and Eigendecompositions of Symmetric Structured Matrices
We present new O(n3) algorithms that compute eigenvalues and eigenvectors to high relative accuracy in floating point arithmetic for the following types of matrices: symmetric Cauchy, symmetric diagonally scaled Cauchy, symmetric Vandermonde, and symmetric totally nonnegative matrices when they are given as products of nonnegative bidiagonal factors. The algorithms are divided into two stages: ...
متن کاملA Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
We propose a superfast solver for Toeplitz linear systems based on rank structured matrix methods and randomized sampling. The solver uses displacement equations to transform a Toeplitz matrix T into a Cauchy-like matrix C, which is known to have low-numerical-rank offdiagonal blocks. Thus, we design a fast scheme for constructing a hierarchically semiseparable (HSS) matrix approximation to C, ...
متن کامل